On Order-convexity Of Syntopogenous Structures (X,S,≤ )
نویسنده
چکیده
In this paper, fuzzy syntopogenous spaces is introduced. First, the *-increasing and *-decreasing spaces have been studied. Second,order-convexity on syntopogenous structures (X,S,≤ ) has been defined. Third, the equivalent description of orderconvexity has been given. Finally, some important properties of order-convexity have been obtained.
منابع مشابه
Connectedness in Syntopogenous Spaces
Introduction. In his monograph [l], Császár introduced the notion of a syntopogenous space, which generalized the notions of a topological space, a proximity space, and a uniform space. Although Császár was able to obtain many of the usual theorems of general topology in this more general setting, the basic topological notion of connectedness was not introduced at all. Mrówka and Pervin [2] hav...
متن کاملSaturated T -syntopogenous spaces
In this paper, we introduce the concepts of saturated T syntopogenous spaces and we prove basic properties of this spaces. We show that the category of perfect saturated T -syntopogenous spaces is isomorphic to category of I -topological spaces 2010 AMS Classification: 54A40
متن کاملBLOW-UP AND NONGLOBAL SOLUTION FOR A FAMILY OF NONLINEAR HIGHER-ORDER EVOLUTION PROBLEM
In this paper we consider a kind of higher-order evolution equation as^{kt^{k} + ^{k&minus1}u/t^{k&minus1} +• • •+ut &minus{delta}u= f (u, {delta}u,x). For this equation, we investigate nonglobal solution, blow-up in finite time and instantaneous blow-up under some assumption on k, f and initial data. In this paper we employ the Test function method, the eneralized convexity method an...
متن کاملContinuous Optimization Multiobjective second - order symmetric duality with F - convexity q
We suggest a pair of second-order symmetric dual programs in multiobjective nonlinear programming. For these second-order symmetric dual programs, we prove the weak, strong and converse duality theorems under F -convexity conditions. 2004 Elsevier B.V. All rights reserved.
متن کاملConvex Rationing Solutions (Incomplete Version, Do not distribute)
This paper introduces a notion of convexity on the rationing problem and characterizes the solutions that are convex. We study the composition of convexity with other traditional axioms explored in the literature such as upper and lower composition. We characterize the class of rules satisfying upper composition and convexity for any number of agents. The dual rules, satisfying lower compositon...
متن کامل